Kernelized Multiview Subspace Analysis By Self-Weighted Learning

نویسندگان

چکیده

With the popularity of multimedia technology, information is always represented or transmitted from multiple views. Most existing algorithms are graph-based ones to learn complex structures within multiview data but overlooked representations. Furthermore, many works treat views discriminatively by introducing some hyperparameters, which undesirable in practice. To this end, abundant based methods have been proposed for dimension reduction. However, there still no research leverage work into a unified framework. address issue, paper, we propose general framework reduction, named Kernelized Multiview Subspace Analysis (KMSA). It directly handles multi-view feature representation kernel space, provides feasible channel direct manipulations on with different dimensions. Meanwhile, compared those methods, KMSA can fully exploit nothing lose. since influences KMSA, self-weighted strategy according their contributions. A co-regularized term promote mutual learning multi-views. combines appropriate weights all We also discuss influence parameters regarding evaluate our 6 datasets classification and image retrieval. The experimental results validate advantages method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernelized Multiview Projection

Conventional vision algorithms adopt a single type of feature or a simple concatenation of multiple features, which is always represented in a high-dimensional space. In this paper, we propose a novel unsupervised spectral embedding algorithm called Kernelized Multiview Projection (KMP) to better fuse and embed different feature representations. Computing the kernel matrices from different feat...

متن کامل

Weighted Incremental Subspace Learning

In a cognitive vision system, learning is expected to be a continuous process, which treats input images and pixels selectively. In this paper we present a method for subspace learning, which takes these considerations into account. First, we present a generalized PCA approach, which estimates the principal subspace considering weighted pixels and images. Next, we propose a method for increment...

متن کامل

Self-weighted Multiview Clustering with Multiple Graphs

In multiview learning, it is essential to assign a reasonable weight to each view according to the view importance. Thus, for multiview clustering task, a wise and elegant method should achieve clustering multiview data while learning the view weights. In this paper, we propose to explore a Laplacian rank constrained graph, which can be approximately as the centroid of the built graph for each ...

متن کامل

Kernelized View Adaptive Subspace Learning for Person Re-identification

Qin Zhou12 [email protected] Shibao Zheng12 [email protected] Hang Su34 [email protected] Hua Yang12 [email protected] Yu Wang12 [email protected] Shuang Wu12 [email protected] 1 Department of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University 2 Shanghai Key Lab of Digital Media Processing and Transmission 3 Department of Computer Science and Technology, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Multimedia

سال: 2021

ISSN: ['1520-9210', '1941-0077']

DOI: https://doi.org/10.1109/tmm.2020.3032023